منابع مشابه
Toward Optimal Motif Enumeration
We present algorithms that reduce the time and space needed to solve problems of finding all motifs common to a set of sequences. In particular, we give algorithms that (1) require time and space linear in the size of the input, (2) succinctly encode the output so that the time and space requirements depend on the number of motifs, not directly on motif length, and (3) efficiently parallelize t...
متن کاملOptimal Global Instruction Scheduling Using Enumeration
Instruction scheduling is one of the most important compiler optimizations. An instruction scheduler reorders instructions to improve performance by minimizing pipeline stalls. Traditional approaches to instruction scheduling were based on heuristics. Over the past decade, however, a number of researchers have proposed optimal solutions to instruction scheduling. This dissertation presents the ...
متن کاملOptimal Enumeration: Efficient Top-k Tree Matching
Driven by many real applications, graph pattern matching has attracted a great deal of attention recently. Consider that a twigpattern matching may result in an extremely large number of matches in a graph; this may not only confuse users by providing too many results but also lead to high computational costs. In this paper, we study the problem of top-k tree pattern matching; that is, given a ...
متن کاملOn the Enumeration of Some D-optimal Designs
Abstract. Two matrices with elements taken from the set {−1, 1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is known about the number of equivalence classes of matrices having maximal determinant. We establish that there are 7 equivalence classes for matrices ...
متن کاملNew results for the enumeration of optimal job sequences
In this paper, we consider the enumeration of all optimal sequences in a two-machine owshop scheduling problem, with maximum completion time criterion. New analytical results are proposed together with an algorithm allowing all optimal sequences to be generated. Computational results are given to illustrate the algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2015
ISSN: 2150-8097
DOI: 10.14778/2735479.2735486